An algorithm for Boolean satisfiability based on generalized orthonormal expansion
نویسنده
چکیده
This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra B0 = {0, 1} and find all satisfying assignments. The algorithm is based on the application of a well known generalized Boole-Shannon orthonormal (ON) expansion of Boolean functions. A necessary and sufficient consistency condition for a special class of functions was developed in [11] using such an expansion. Paper [11] develops a condition for consistency of the equation f(X) = 0 for the special classes of Boolean functions 1) f in B(Φ(X)) for an ON set Φ of Boolean functions in X over a general Boolean algebra B and 2) f in B(X2)(Φ(X1)). The present paper addresses the problem of obtaining the consistency conditions for arbitrary Boolean functions in B0(X). Next, the consistency for a single equation is shown equivalent to another system of Boolean equations which involves the ON functions and characterizes all solutions. This result is then extended for Boolean systems in several variables over the algebra B0 = {0, 1} which does not convert the system into a single equation. This condition leads to the algorithm for computing all solutions of the Boolean system without using analogous resolution and determine satisfiability. For special systems defined by CNF formulas this algorithm results into an extension of the DPLL algorithm in which the splitting rule is generalized to several variables in terms of ON terms in the sense that splitting of CNF set in a single variable x is equivalent to ON terms x, x. Category: cs.CC, cs.SC, ms.RA ACM class: I.1.2, F.2.2, G.2 MSC class: 03G05, 06E30, 94C10.
منابع مشابه
Generalized cofactors and decomposition of Boolean satisfiability problems
We propose an approach for decomposing Boolean satisfiability problems while extending recent results of [12] on solving Boolean systems of equations. Developments in [12] were aimed at the expansion of functions f in orthonormal (ON) sets of base functions as a generalization of the Boole-Shannon expansion and the derivation of the consistency condition for the equation f = 0 in terms of the e...
متن کاملSolutions of Boolean equations by orthonormal expansion
Developments in solving equations over Boolean algebras and their applications are as old as George Boole’s monograph [1], while Shannon pioneered applications of Boolean logic to switching circuits. Boolean equations and their solutions are of central importance to many problems across Sciences such as Chemistry, Biology or Medicine while traditionally Boolean problems arise in domains such as...
متن کاملGeneralized Craig Interpolation for Stochastic Boolean Satisfiability Problems
The stochastic Boolean satisfiability (SSAT) problem has been introduced by Papadimitriou in 1985 when adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, among them bounded model checking (BMC) of symbolically represented Markov decision processes. This paper identifies a notion of Craig interpolant for the ...
متن کاملOn solving Boolean combinations of generalized 2SAT constraints
" is the maximum over the absolute values of constants appearing in the constraints. This solution bound improves over previously obtained bounds by an exponential factor. Our result enables a new enumerative approach to satisfiability checking. An experimental evaluation demonstrates the efficiency of this approach over previous techniques. As a corollary of our main result, we obtain a polyno...
متن کاملGeneralization of Boole-Shannon expansion, consistency of Boolean equations and elimination by orthonormal expansion
The well known Boole -Shannon expansion of Boolean functions in several variables (with coefficients in a Boolean algebra B) is also known in more general form in terms of expansion in a set Φ of orthonormal functions. However, unlike the one variable step of this expansion an analogous elimination theorem and consistency is not well known. This article proves such an elimination theorem for a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.4712 شماره
صفحات -
تاریخ انتشار 2014